On Adjacency and e-Adjacency in General Hypergraphs: Towards a New e-Adjacency Tensor
نویسندگان
چکیده
منابع مشابه
Spatial Adjacency - a General Approach
It is fact universally acknowledged that discrete computing systems are ill-equipped to process vector-based spatial information: inexact line intersection calculations and similar geometric (co-ordinate) operations can not readily guarantee consistent graphical structures (topology). It is proposed here that use of Voronoi diagrams, especially euclidean-distance nearest-object Voronoi diagrams...
متن کاملAdjacency Matrix and Co-occurrence Tensor of General Hypergraphs: Two Well Separated Notions
Adjacency and co-occurence are two well separated notions: even if they are the same for graphs, they start to be two different notions for uniform hypergraphs. After having done the difference between the two notions, this paper contributes in the definition of a co-occurence tensor reflecting the general hypergraph structure. It is a challenging issue that can have many applications if proper...
متن کاملAdjacency on Combinatorial Polyhedra
This paper shows some useful properties of the adjacency structures of a class of combinatorial polyhedra including the equality constrained 0-1 polytopes. The class of polyhedra considered here includes 0-1 polytopes related to some combinatorial optimization problems; e.g., set partitioning polytopes, set packing polytopes, perfect matching polytopes, vertex packing polytopes and all the face...
متن کاملKnot Adjacency and Fibering
It is known that the Alexander polynomial detects fibered knots and 3-manifolds that fiber over the circle. In this note, we show that when the Alexander polynomial becomes inconclusive, the notion of knot adjacency can be used to obtain obstructions to fibering of knots and of 3-manifolds. As an application, given a fibered knot K′, we construct infinitely many non-fibered knots that share the...
متن کاملAdjacency and Nonadjacency Learning
When children learn their native language, they have to deal with a confusing array of dependencies between various elements in an utterance. The dependent elements may be adjacent to one another or separated by intervening material. Prior studies suggest that nonadjacent dependencies are hard to learn when the intervening material has little variability, which may be due to a tradeoff between ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2018
ISSN: 1571-0653
DOI: 10.1016/j.endm.2018.11.012